The Nonexistence of a Certain Steiner System
نویسندگان
چکیده
Although the automorphism group of a projective plane of order 10, if one exists, must be very small, such a plane could be the derived design of a Steiner system S(3, 12, 112) with a larger group. There are several reasons why the Frobenius group of order 56 is a promising candidate for the latter group. However, in this paper it is shown that there is no S(3, 12, 112) which is fixed by this Frobenius group. It is not known if a projective plane of order 10 exists; however, if one does exist its automorphism group must have order 1 or 3 [l, 171. A plane with such a small group is difficult to analyze. It is possible, however, that this plane arises as the derived design of a Steiner system S(3, 12, 112) having a larger group, i.e., that it is a cross section of a nicer object. The possible orders for the automorphism group of a Steiner system S(3, 12, 112) are 2', 3 * 2' or 7. 2', for 0 < i < 4. In particular this group is solvable. There are several reasons for trying to find an S(3, 12, 112) which is fixed by the Frobenius group of order 56. (i) This group is a promising candidate to try since any Desarguesian aftine plane of order n is fixed by a Frobenius group (namely, the group of order n(n-1) consisting of the mappings
منابع مشابه
On the nonexistence of 2-cycles for the 3x+1 problem
This article generalizes a proof of Steiner for the nonexistence of 1-cycles for the 3x + 1 problem to a proof for the nonexistence of 2-cycles. A lower bound for the cycle length is derived by approximating the ratio between numbers in a cycle. An upper bound is found by applying a result of Laurent, Mignotte, and Nesterenko on linear forms in logarithms. Finally numerical calculation of conve...
متن کاملThe Steiner diameter of a graph
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $Ssubseteq V(G)$, the Steiner distance $d(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $...
متن کاملNordhaus-Gaddum type results for the Harary index of graphs
The emph{Harary index} $H(G)$ of a connected graph $G$ is defined as $H(G)=sum_{u,vin V(G)}frac{1}{d_G(u,v)}$ where $d_G(u,v)$ is the distance between vertices $u$ and $v$ of $G$. The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ ...
متن کاملNonexistence of sparse triple systems over abelian groups and involutions
In 1973 Paul Erdős conjectured that there is an integer v0(r) such that, for every v > v0(r) and v ≡ 1,3 (mod 6), there exists a Steiner triple system of order v, containing no i blocks on i + 2 points for every 1 < i ≤ r . Such an STS is said to be r-sparse. In this paper we consider relations of automorphisms of an STS to its sparseness. We show that for every r ≥ 13 there exists no point-tra...
متن کاملOn the Nonexistence of Perfect Codes in the Johnson Scheme
Although it was conjectured by Delsarte in 1973 that no nontrivial perfect codes exist in the Johnson scheme, only very partial results are known. In this paper we considerably reduce the range in which perfect codes in the Johnson scheme can exist; e.g., we show that there are no nontrivial perfect codes in the Johnson graph J(2w qp, w), p prime. We give theorems about the structure of perfect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 30 شماره
صفحات -
تاریخ انتشار 1981